Toggle navigation
Home
About
About Journal
Historical Evolution
Indexed In
Awards
Reference Index
Editorial Board
Journal Online
Archive
Project Articles
Most Download Articles
Most Read Articles
Instruction
Contribution Column
Author Guidelines
Template
FAQ
Copyright Agreement
Expenses
Academic Integrity
Contact
Contact Us
Location Map
Subscription
Advertisement
中文
Journals
Publication Years
Keywords
Search within results
(((XIE Xiaojun[Author]) AND 1[Journal]) AND year[Order])
AND
OR
NOT
Title
Author
Institution
Keyword
Abstract
PACS
DOI
Please wait a minute...
For Selected:
Download Citations
EndNote
Ris
BibTeX
Toggle Thumbnails
Select
Data gathering optimization based on dynamic data compression in energy harvesting wireless sensor network
XIE Xiaojun, YU Hao, TAO Lei, ZHANG Xinming
Journal of Computer Applications 2018, 38 (
8
): 2353-2358. DOI:
10.11772/j.issn.1001-9081.2018020360
Abstract
(
463
)
PDF
(976KB)(
357
)
Knowledge map
Save
Aiming at the data gathering optimization problem in energy harvesting Wireless Sensor Network (WSN), a scheme based on dynamic sensor node sampling rate and data compression was proposed, where the spatial-temporal characteristics of energy harvested by individual sensor node was considered. To maximize the total amount of sampling data in the network, first, according to the neighbor information of the nodes, a local compression algorithm was proposed to determine the optimal compression strategy. Considering the data receiving and forwarding energy consumption of the node based on its topological position in the data aggregation tree, its sampling rate was gradually increased until its total energy consumption reached the collection energy consumption threshold. After that, a global optimization problem of network performance was constructed, and a heuristic algorithm was proposed. By iteratively solving linear programming problems, the optimal sampling rate and compression scheme were obtained. The experimental results show that compared with the existing adaptive sensing and compression rate selection scheme, the proposed two data collection optimization algorithms can maintain more stable sensor node battery levels and achieve higher network performance.
Reference
|
Related Articles
|
Metrics
Select
Energy-balanced routing algorithm in rechargeable wireless sensor networks
XIE Xiaojun, YU Hao, TAO Lei, ZHANG Xinming
Journal of Computer Applications 2017, 37 (
6
): 1545-1549. DOI:
10.11772/j.issn.1001-9081.2017.06.1545
Abstract
(
354
)
PDF
(845KB)(
658
)
Knowledge map
Save
Aiming at energy-balanced routing problem in rechargeable Wireless Sensor Network (WSN), a new multi-path routing algorithm and an opportunistic routing algorithm were proposed in the scenario of wireless charging with stable power and monitoring data collection network, so as to achieve the energy balance of the network. Firstly, the relationship model between the charging power and the receiving power of wireless sensor nodes was constructed by the theory of electromagnetic propagation. Then, considering the sending and receiving energy consumptions of wireless sensor nodes in the network, the energy-balanced routing problem was transformed into the max-min optimization lifetime problem of the network nodes. The link traffic obtained by the linear programming was used to guide the data flow allocation in the routing. Finally, considering a more realistic scenario of low power WSN, an energy-balanced routing algorithm based on opportunistic routing was proposed. The experimental results show that, compared with the Shortest Path Routing (SPR) and Expected Duty-Cycled wakeups minimal routing (EDC) algorithms, the proposed two routing algorithms can effectively improve the utilization ratio of the energy collection and the network lifetime in the working period.
Reference
|
Related Articles
|
Metrics